Simulated Annealing Optimization of PMBLDC Motor Speed and Current Controllers
نویسندگان
چکیده
منابع مشابه
Hysteresis Current Controlled Pmbldc Motor Drive
The paper presents a methodology for developing adaptive speed controllers in a permanent-magnet brushless DC (BLDC) motor drive system. A proportional-integral controller is employed in order to obtain the controller parameters at each selected load. The resulting data from PI controller are used to train adaptive neuro-fuzzy inference systems (ANFIS) that could deduce the controller parameter...
متن کاملSpeed and Current Controllers Design of BLDC Motor Using SNR Optimization Technique
In this paper, a novel tuning technique for the current and speed controllers of the Brushless DC (BLDC) motor derive system is presented. The parameters of PI controllers in the inner current control loop and outer speed control loop which vary with the operating conditions such as variation of temperature and saturation phenomena or load torque changing of the drive are adjusted in order to m...
متن کاملRobust Tuning for the Speed Controller of Pmbldc Motor
Nowadays, motion control systems in industry are designed with fixed PLrPID cascade control loops. These control loops do not take into account the dynamic load variations that occur in many systems. Therefore, as the dynamics of the process inevitably varies, they fall out of tune, which causes the performance and stability to degrade. Also, time delays often arise in motor control systems, bo...
متن کاملOptimization by simulated annealing.
There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...
متن کاملSimulated Annealing and Global Optimization
Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: WSEAS TRANSACTIONS ON POWER SYSTEMS
سال: 2020
ISSN: 1790-5060
DOI: 10.37394/232016.2020.15.23